Covering Polygonal Annuli by Strips
نویسندگان
چکیده
منابع مشابه
Covering Polygonal Annuli by Strips
In 2000 A. Bezdek asked which plane convex bodies have the property that whenever an annulus, consisting of the body less a sufficiently small scaled copy of itself, is covered by strips, the sum of the widths of the strips must still be at least the minimal width of the body. We characterise the polygons for which this is so. In this note we will give a complete answer for convex polygons to t...
متن کاملCovering a Polygonal Region by Ellipses
We study the problem of how to cover a polygonal region by a small number of axis–parallel ellipses. This question is well motivated by a special pattern recognition task where one has to identify ellipse shaped protein spots in 2–dimensional electrophoresis images. We present and discuss two algorithmic approaches solving this problem: a greedy brute force method and a linear programming formu...
متن کاملCovering a polygonal region by rectangles
The problem of covering a compact canonical polygonal region, called target region, with a finite family of rectangles is considered. Tools for mathematical modeling of the problem are provided. Especially, a function, called Γ-function, is introduced which indicates whether the rectangles with respect to their configuration form a cover of the target region or not. The construction of the Γ-fu...
متن کاملCovering Simple Polygonal Regions by Ellipses
We study the problem of how to cover simple polygonal rectilinear regions by a small set of axis–parallel ellipses. This question is well motivated by a special pattern recognition task where one has to identify ellipse shaped protein spots in 2–dimensional electrophoresis images. We present and discuss various algorithmic approaches towards this problem ranging from a brute force method, to a ...
متن کاملON COVERING POINTS WITH CONICS AND STRIPS IN THE PLANE A Thesis by PRAVEEN TIWARI
Geometric covering problems have always been of focus in computer scientific research. The generic geometric covering problem asks to cover a set S of n objects with another set of objects whose cardinality is minimum, in a geometric setting. Many versions of geometric cover have been studied in detail, one of which is line cover: Given a set of points in the plane, find the minimum number of l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2007
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-007-1305-z